Construction of t-Resilient Functions over a Finite Alphabet
نویسندگان
چکیده
Wr rxttnd the notions of correlation-immune functions and resilient functions to functions over any finite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Slinsori as wc givc an orthogonal array characterizat,ion and a Fourier transform characterization for resilient functions over any finite alphabet. This leads to a generalization of some related cryphgrapliic ubjeck as perrecl 1oc:al raiidomixcrs. 11 also eriablcs us l o construct new resilient functions by cornpositmion of resilient functions of smaller order.
منابع مشابه
Construction of resilient functions over a finite alphabet
We extend the notions of correlation-immune functions and resilient functions to functions over any nite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform characterization for resilient functions over any nite alphabet. This leads to a generalization of som...
متن کاملCorrelation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography
We extend the notions of correlation-immune functions and resilient functions to functions over any finite alphabet. A previous result due to Gopalakrishnan and Stinson is generalized as we give an orthogonal array characterization, a Fourier transform and a matrix characterization for correlation-immune and resilient functions over any finite alphabet endowed with the structure of an Abelian g...
متن کاملAuthentication codes based on resilient Boolean maps
We introduce new constructions of systematic authentication codes over finite fields and Galois rings. One code is built over finite fields using resilient functions and it provides optimal impersonation and substitution probabilities. Other two proposed codes are defined over Galois rings, one is based on resilient maps and it attains optimal probabilities as well, while the other uses maps wh...
متن کاملCoinductive Properties of Lipschitz Functions on Streams
A simple hierarchical structure is imposed on the set of Lipschitz functions on streams (i.e. sequences over a fixed alphabet set) under the standard metric. We prove that sets of non-expanding and contractive functions are closed under a certain coiterative construction. The closure property is used to construct new final stream coalgebras over finite alphabets. For an example, we show that th...
متن کاملOn construction of resilient functions
An (n, m, t) resilient function is a function f: f0,1g n ?!f0,1g m such that every possible output m-tuple is equally likely to occur when the values of t arbitrary inputs are xed by an opponent and the remaining n ? t input bits are chosen independently at random. The existence of resilient functions has been largely studied in terms of lower and upper bounds. The construction of such function...
متن کامل